p-Basilica Groups

Building Conversational Agents with Basilica

Basilica is an event-driven software architecture for creating conversational agents as a collection of reusable components. Software engineers and computer scientists can use this general architecture to create increasingly sophisticated conversational agents. We have developed agents based on Basilica that have been used in various application scenarios and foresee that agents build on Basili...

Some Properties of p-Groups and Commutative p-Groups

For simplicity, we use the following convention: G is a group, a, b are elements of G, m, n are natural numbers, and p is a prime natural number. One can prove the following propositions: (1) If for every natural number r holds n 6= pr, then there exists an element s of N such that s is prime and s | n and s 6= p. (2) For all natural numbers n, m such that n | pm there exists a natural number r...

Character degrees of p-groups and pro-p groups

In the 1970s, Isaacs conjectured that there should be a logarithmic bound for the length of solvability of a p-group G with respect to the number of different irreducible character degrees of G. So far, there are just a few partial results for this conjecture. In this note, we say that a pro-p group G has property (I) if there is a real number D = D(G) that just depends on G such that for any o...

Finite Groups with p-Sylow Coverings

Laplacians on the Basilica Julia Set

We consider the basilica Julia set of the polynomial P (z) = z − 1 and construct all possible resistance (Dirichlet) forms, and the corresponding Laplacians, for which the topology in the effective resistance metric coincides with the usual topology. Then we concentrate on two particular cases. One is a self-similar harmonic structure, for which the energy renormalization factor is 2, the expon...